منابع مشابه
Domain Triangulation Between Convex Polytopes
In this paper, we propose a method for solving the problem triangulation of a domain between convex polyhedrons in ddimensional space using Delaunay triangulation in O(N) time. Novelty of our work is in using a modified Delaunay triangulation algorithm with constraints.
متن کاملA Convex Metric with Unique Segments
1. H. M. Elliott, On approximation to functions satisfying a generalized continuity condition, Trans. Amer. Math. Soc. vol. 71 (1951) pp. 1-23. 2. W. E. Sewell, Continuity and degree of approximation by rational functions, Revista de Ciencias vol. 41 (1939) pp. 435-451. 3. J. L. Walsh, Interpolation and approximation by rational functions in the complex domain, Amer. Math. Soc. Colloquium Publi...
متن کاملOn the Triangulation of Convex Polygons Presenting T{Vertices
A technique to triangulate planar convex polygons presenting T{vertices is described. Simple strip or fan tessellation of a polygon with T{vertices can result in zero{area triangles and compromise the rendering process. Our technique splits such a polygon into one triangle strip and, at most, one triangle fan. The utility is particularly useful in multiresolution or adaptive representation of p...
متن کاملBlock Method for Convex Polygon Triangulation
In this paper, the block method for convex polygon triangulation is presented. The method is based on the usage of the previously generated triangulations for polygon with smaller number of vertices. In the beginning, we establish some relations between the triangulations of the polygons having the consecutive number of vertices. Using these relations, we decompose the triangulation problem int...
متن کاملMinimum Pseudo-Triangulation Using Convex Hull Layers
Pseudo-triangulation is regarded as one of the most commonly used problems in computational geometry. In this paper we consider the problem of minimum pseudotriangulation of a given set of points S in the plane using convex hull layers and we propose two new methods that will lead to the production of minimum pseudo-triangulation. This means that the number of pseudo-triangles created in minimu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90588-k